0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n025.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 960
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Aug  9 02:20:11 EDT 2022
0.13/0.35	% CPUTime    : 
0.20/0.49	Running higher-order on 8 cores theorem proving
0.20/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.49	# Version: 3.0pre003-ho
0.20/0.50	# Preprocessing class: HSMSSMSSMLLNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.50	# Starting post_as_ho3 with 120s (1) cores
0.20/0.50	# Starting new_ho_12 with 120s (1) cores
0.20/0.50	# Starting new_bool_2 with 120s (1) cores
0.20/0.50	# new_ho_12 with pid 23286 completed with status 0
0.20/0.50	# Result found by new_ho_12
0.20/0.50	# Preprocessing class: HSMSSMSSMLLNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.50	# Starting post_as_ho3 with 120s (1) cores
0.20/0.50	# Starting new_ho_12 with 120s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HGHNS-FFMM21-SHSSMFNN
0.20/0.50	# partial match(2): HGUNS-FFMF21-SHSSMFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.50	# Starting new_ho_10 with 65s (1) cores
0.20/0.50	# new_ho_10 with pid 23289 completed with status 0
0.20/0.50	# Result found by new_ho_10
0.20/0.50	# Preprocessing class: HSMSSMSSMLLNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.50	# Starting post_as_ho3 with 120s (1) cores
0.20/0.50	# Starting new_ho_12 with 120s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HGHNS-FFMM21-SHSSMFNN
0.20/0.50	# partial match(2): HGUNS-FFMF21-SHSSMFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.50	# Starting new_ho_10 with 65s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_22, type, mrel: mworld > mworld > $o).
0.20/0.50	thf(decl_23, type, mactual: mworld).
0.20/0.50	thf(decl_24, type, mlocal: (mworld > $o) > $o).
0.20/0.50	thf(decl_25, type, mnot: (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_30, type, mbox: (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_31, type, mdia: (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_32, type, eiw_di: $i > mworld > $o).
0.20/0.50	thf(decl_33, type, mforall_di: ($i > mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_34, type, mexists_di: ($i > mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_35, type, empty_set: $i).
0.20/0.50	thf(decl_36, type, qmltpeq: $i > $i > mworld > $o).
0.20/0.50	thf(decl_37, type, in: $i > $i > mworld > $o).
0.20/0.50	thf(decl_38, type, empty: $i > mworld > $o).
0.20/0.50	thf(decl_39, type, singleton: $i > $i).
0.20/0.50	thf(decl_40, type, set_difference: $i > $i > $i).
0.20/0.50	thf(decl_41, type, esk1_1: mworld > $i).
0.20/0.50	thf(decl_42, type, esk2_0: $i).
0.20/0.50	thf(decl_43, type, esk3_0: $i).
0.20/0.50	thf(decl_44, type, esk4_0: $i).
0.20/0.50	thf(decl_45, type, esk5_0: $i).
0.20/0.50	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mlocal_def)).
0.20/0.50	thf(mor_def, axiom, ((mor)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)|(X4 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mor_def)).
0.20/0.50	thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:(((eiw_di @ X7 @ X3)=>(X6 @ X7 @ X3)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mforall_di_def)).
0.20/0.50	thf(mnot_def, axiom, ((mnot)=(^[X2:mworld > $o, X3:mworld]:(~((X2 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mnot_def)).
0.20/0.50	thf(mequiv_def, axiom, ((mequiv)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)<=>(X4 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mequiv_def)).
0.20/0.50	thf(t69_zfmisc_1, conjecture, (mlocal @ (mforall_di @ (^[X15:$i]:(mforall_di @ (^[X16:$i]:(mor @ (qmltpeq @ (set_difference @ (singleton @ X15) @ X16) @ empty_set) @ (qmltpeq @ (set_difference @ (singleton @ X15) @ X16) @ (singleton @ X15)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', t69_zfmisc_1)).
0.20/0.50	thf(l34_zfmisc_1, axiom, (mlocal @ (mforall_di @ (^[X30:$i]:(mforall_di @ (^[X31:$i]:(mequiv @ (qmltpeq @ (set_difference @ (singleton @ X30) @ X31) @ (singleton @ X30)) @ (mnot @ (in @ X30 @ X31)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l34_zfmisc_1)).
0.20/0.50	thf(l36_zfmisc_1, axiom, (mlocal @ (mforall_di @ (^[X13:$i]:(mforall_di @ (^[X14:$i]:(mequiv @ (qmltpeq @ (set_difference @ (singleton @ X13) @ X14) @ empty_set) @ (in @ X13 @ X14))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l36_zfmisc_1)).
0.20/0.50	thf(c_0_8, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.20/0.50	thf(c_0_9, plain, ((mor)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor_def])).
0.20/0.50	thf(c_0_10, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:(((eiw_di @ X7 @ Z1)=>(Z0 @ X7 @ Z1)))))), inference(fof_simplification,[status(thm)],[mforall_di_def])).
0.20/0.50	thf(c_0_11, plain, ((mnot)=(^[Z0:mworld > $o, Z1:mworld]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot_def])).
0.20/0.50	thf(c_0_12, plain, ((mequiv)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv_def])).
0.20/0.50	thf(c_0_13, negated_conjecture, ~(![X49:$i]:(((eiw_di @ X49 @ mactual)=>![X48:$i]:(((eiw_di @ X48 @ mactual)=>((qmltpeq @ (set_difference @ (singleton @ X49) @ X48) @ empty_set @ mactual)|(qmltpeq @ (set_difference @ (singleton @ X49) @ X48) @ (singleton @ X49) @ mactual))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t69_zfmisc_1])]), c_0_8]), c_0_9]), c_0_10])).
0.20/0.50	thf(c_0_14, plain, ![X66:$i]:(((eiw_di @ X66 @ mactual)=>![X65:$i]:(((eiw_di @ X65 @ mactual)=>((qmltpeq @ (set_difference @ (singleton @ X66) @ X65) @ (singleton @ X66) @ mactual)<=>~(in @ X66 @ X65 @ mactual)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[l34_zfmisc_1]), c_0_8]), c_0_11]), c_0_12]), c_0_10])])).
0.20/0.50	thf(c_0_15, plain, ![X47:$i]:(((eiw_di @ X47 @ mactual)=>![X46:$i]:(((eiw_di @ X46 @ mactual)=>((qmltpeq @ (set_difference @ (singleton @ X47) @ X46) @ empty_set @ mactual)<=>(in @ X47 @ X46 @ mactual)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[l36_zfmisc_1]), c_0_8]), c_0_12]), c_0_10])).
0.20/0.50	thf(c_0_16, negated_conjecture, ((eiw_di @ esk2_0 @ mactual)&((eiw_di @ esk3_0 @ mactual)&(~(qmltpeq @ (set_difference @ (singleton @ esk2_0) @ esk3_0) @ empty_set @ mactual)&~(qmltpeq @ (set_difference @ (singleton @ esk2_0) @ esk3_0) @ (singleton @ esk2_0) @ mactual)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
0.20/0.50	thf(c_0_17, plain, ![X101:$i, X102:$i]:(((~(qmltpeq @ (set_difference @ (singleton @ X101) @ X102) @ (singleton @ X101) @ mactual)|~(in @ X101 @ X102 @ mactual)|~(eiw_di @ X102 @ mactual)|~(eiw_di @ X101 @ mactual))&((in @ X101 @ X102 @ mactual)|(qmltpeq @ (set_difference @ (singleton @ X101) @ X102) @ (singleton @ X101) @ mactual)|~(eiw_di @ X102 @ mactual)|~(eiw_di @ X101 @ mactual)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])).
0.20/0.50	thf(c_0_18, plain, ![X80:$i, X81:$i]:(((~(qmltpeq @ (set_difference @ (singleton @ X80) @ X81) @ empty_set @ mactual)|(in @ X80 @ X81 @ mactual)|~(eiw_di @ X81 @ mactual)|~(eiw_di @ X80 @ mactual))&(~(in @ X80 @ X81 @ mactual)|(qmltpeq @ (set_difference @ (singleton @ X80) @ X81) @ empty_set @ mactual)|~(eiw_di @ X81 @ mactual)|~(eiw_di @ X80 @ mactual)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])).
0.20/0.50	thf(c_0_19, negated_conjecture, ~((qmltpeq @ (set_difference @ (singleton @ esk2_0) @ esk3_0) @ (singleton @ esk2_0) @ mactual)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.50	thf(c_0_20, plain, ![X9:$i, X7:$i]:(((in @ X7 @ X9 @ mactual)|(qmltpeq @ (set_difference @ (singleton @ X7) @ X9) @ (singleton @ X7) @ mactual)|~((eiw_di @ X9 @ mactual))|~((eiw_di @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.50	thf(c_0_21, negated_conjecture, (eiw_di @ esk3_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.50	thf(c_0_22, negated_conjecture, (eiw_di @ esk2_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.50	thf(c_0_23, negated_conjecture, ~((qmltpeq @ (set_difference @ (singleton @ esk2_0) @ esk3_0) @ empty_set @ mactual)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.50	thf(c_0_24, plain, ![X9:$i, X7:$i]:(((qmltpeq @ (set_difference @ (singleton @ X7) @ X9) @ empty_set @ mactual)|~((in @ X7 @ X9 @ mactual))|~((eiw_di @ X9 @ mactual))|~((eiw_di @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.20/0.50	thf(c_0_25, negated_conjecture, (in @ esk2_0 @ esk3_0 @ mactual), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21]), c_0_22])])).
0.20/0.50	thf(c_0_26, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_21]), c_0_22])]), c_0_25])]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 48
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 45
0.20/0.50	# Removed in clause preprocessing      : 20
0.20/0.50	# Initial clauses in saturation        : 25
0.20/0.50	# Processed clauses                    : 47
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 0
0.20/0.50	# ...remaining for further processing  : 46
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 0
0.20/0.50	# Backward-rewritten                   : 0
0.20/0.50	# Generated clauses                    : 13
0.20/0.50	# ...of the previous two non-redundant : 9
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 0
0.20/0.50	# Paramodulations                      : 13
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 21
0.20/0.50	#    Positive orientable unit clauses  : 9
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 3
0.20/0.50	#    Non-unit-clauses                  : 9
0.20/0.50	# Current number of unprocessed clauses: 12
0.20/0.50	# ...number of literals in the above   : 63
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 25
0.20/0.50	# Clause-clause subsumption calls (NU) : 111
0.20/0.50	# Rec. Clause-clause subsumption calls : 44
0.20/0.50	# Non-unit clause-clause subsumptions  : 0
0.20/0.50	# Unit Clause-clause subsumption calls : 6
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 0
0.20/0.50	# BW rewrite match successes           : 0
0.20/0.50	# Condensation attempts                : 47
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 5885
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.003 s
0.20/0.50	# System time              : 0.003 s
0.20/0.50	# Total time               : 0.006 s
0.20/0.50	# Maximum resident set size: 2144 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.004 s
0.20/0.50	# System time              : 0.006 s
0.20/0.50	# Total time               : 0.010 s
0.20/0.50	# Maximum resident set size: 1776 pages
0.20/0.50	EOF